Data Cubes in Dynamic Environments

نویسندگان

  • Steven Geffner
  • Mirek Riedewald
  • Divyakant Agrawal
  • Amr El Abbadi
چکیده

The data cube, also known in the OLAP community as the multidimensional database, is designed to provide aggregate information that can be used to analyze the contents of databases and data warehouses. Previous research mainly focussed on strategies for supporting queries, assuming that updates do not play an important role and can be propagated to the data cube in batches. While this might be sufficient for most of today’s applications, there is growing evidence that modern interactive data analysis applications will have to balance update and query costs. Two techniques for maintaining data cubes in dynamic environments are described here. The first, Relative Prefix Sums (RPS), supports a constant response time for ad-hoc range sum queries on the data cube, while at the same time greatly reducing the update costs compared to prior approaches. The second, the Dynamic Data Cube (DDC), guarantees a sub-linear cost for both range sum queries and updates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Space-Efficient Data Cubes for Dynamic Environments

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on the y can result in non-interactive response times (e.g. in the order of minutes). To speed up range queries, valu...

متن کامل

Space-E cient Data Cubes for Dynamic Environments

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-they can result in non-interactive response times (e.g., in the order of minutes). To speed up range queries, valu...

متن کامل

Space-eecient Data Cubes for Dynamic Environments ?

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-they can result in non-interactive response times. To speed up range queries, values that summarize regions of the...

متن کامل

cient Data Cubes for Dynamic Environments ?

Data cubes provide aggregate information to support the analysis of the contents of data warehouses and databases. An important tool to analyze data in data cubes is the range query. For range queries that summarize large regions of massive data cubes, computing the query result on-they can result in non-interactive response times. To speed up range queries, values that summarize regions of the...

متن کامل

Adaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments

Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Data Eng. Bull.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 1999